Probabilistic Programming Models for Response Vehicle Dispatching and Resource Allocation in Traffic Incident Management

نویسندگان

  • Kaan Ozbay
  • Weihua Xiao
  • Melike Baykal-Gursoy
چکیده

This paper proposes mathematical programming models with probabilistic constraints in order to address incident response and resource allocation problems for traffic incident management. In incident response problems, we introduce the concept of quality of service during a potential incident to give the operator the flexibility to determine the optimal dispatching policy in response to various situations. A mixedinteger programming (MIP) model with probabilistic constraints is proposed to address the dispatching problem with consideration given to the stochastic resource requirements at the sites of the potential incidents. For the resource allocation problem, assuming that the stochastic distribution of incidents over a network is given, we introduce a mathematical model to determine the number of service vehicles allocated to each depot to meet the requirements of the potential incidents by taking into account the stochastic nature of the resource requirement and incident occurrence probabilities. For completeness, relevant concepts and solution algorithms in stochastic programming are also presented. Several examples are included to demonstrate the applications of these models to real-world problems. This paper concludes with a summary of results and recommendations for future research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic programming models for traffic incident management operations planning

This paper proposes mathematical programming models with probabilistic constraints in order to address incident response and resource allocation problems for the planning of traffic incident management operations. For the incident response planning, we introduce the concept of quality of service during a potential incident to give the decision-maker the flexibility to determine the optimal poli...

متن کامل

Using Probabilistic-Risky Programming Models in Identifying Optimized Pattern of Cultivation under Risk Conditions (Case Study: Shoshtar Region)

Using Telser and Kataoka models of probabilistic-risky mathematical programming, the present research is to determine the optimized pattern of cultivating the agricultural products of Shoshtar region under risky conditions. In order to consider the risk in the mentioned models, time period of agricultural years 1996-1997 till 2004-2005 was taken into account. Results from Telser and Kataoka mod...

متن کامل

A Mathematical Model to Optimize Allocation Sequence in Dispatching Problem

Truck-Shovel fleet, as the most common transportation system in open-pit mines, has a significant part of mining costs, for which optimal management can lead to substantial cost reductions. Among the available dispatch mathematical models, the multi-stage approach is well suited for allocating trucks to respected shovels in a dynamic dispatching program. However, with this kind of modeling sequ...

متن کامل

A Bi-level Formulation for Centralized Resource Allocation DEA Models

In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003